A linear algorithm for minimum 1-identifying codes in oriented trees

Computation of Minimum Hamming Weight for Linear Codes

In this paper, we consider the minimum Hamming weight for linear codes over special finite quasi-Frobenius rings. Furthermore, we obtain minimal free $R$-submodules of a finite quasi-Frobenius ring $R$  which contain a linear code and derive the relation between their minimum Hamming weights. Finally, we suggest an algorithm that computes this weight using the Grobner basis and we show that und...

1-identifying Codes on Trees

Optimal linear identifying codes

Minimum-Density Identifying Codes in Square Grids

An identifying code in a graph G is a subset of vertices with the property that for each vertex v ∈ V (G), the collection of elements of C at distance at most 1 from v is non-empty and distinct from the collection of any other vertex. We consider the minimum density d(Sk) of an identifying code in the square grid Sk of height k (i.e. with vertex set Z × {1, . . . , k}). Using the Discharging Me...

Locating-domination and identifying codes in trees